Search results for "Pseudorandom binary sequence"
showing 7 items of 7 documents
On the loopless generation of binary tree sequences
1998
Weight sequences were introduced by Pallo in 1986 for coding binary trees and he presented a constant amortized time algorithm for their generation in lexicographic order. A year later, Roelants van Baronaigien and Ruskey developed a recursive constant amortized time algorithm for generating Gray code for binary trees in Pallo's representation. It is common practice to find a loopless generating algorithm for a combinatorial object when enunciating a Gray code for this object. In this paper we regard weight sequences as variations and apply a Williamson algorithm in order to obtain a loopless generating algorithm for the Roelants van Baronaigien and Ruskey's Gray code for weight sequences.
The sequence of open and closed prefixes of a Sturmian word
2017
A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the {\it oc-sequence} of a word, which is the binary sequence whose $n$-th element is $0$ if the prefix of length $n$ of the word is open, or $1$ if it is closed. We exhibit results showing that this sequence is deeply related to the combinatorial and periodic structure of a word. In the case of Sturmian words, we show that these are uniquely determined (up to renaming letters) by their oc-sequence. Moreover, we prove that the class of finite Sturmian words is a maximal element with this property in the class of binar…
Identification and Robust Control of a Quadratic DC/DC Boost Converter by Hammerstein Model
2015
This paper deals with the theoretical framework definition and the experimental application of the Hammerstein (HM) identification and related robust control technique to a quadratic dc/dc single-switch boost (Q-boost) converter. A set of fourth-order transfer functions (TFs) has been identified with the Hammerstein approach, on the basis of a pseudorandom-binary-sequence (PRBS) excitation signal. The set of identified TFs has been then used to design a suitable robust control technique, able to properly deal with the converter parameter uncertainty and load variations. The proposed approach has been tested in numerical simulation and validated experimentally on a suitably developed test se…
Identification of Nonlinear Systems Described by Hammerstein Models
2004
This paper deals with a method for identification of nonlinear systems suitable to be described by Hammerstein models consisting of a static nonlinearity followed by an ARX linear model. The estimation of the static nonlinearity is carried out supplying the system with a sequence of step signals of various amplitude and determining the corresponding steady-state responses. The estimation of the parameters of the ARX linear system is carried out by means of a least square estimator using data generated supplying the system with a Pseudorandom Binary Sequence (PRBS). The method in question is able to identify static nonlinearities of general type, also with hysteresis and/or discontinuities. …
Nonlinear Modeling of DC/DC Converters Using the Hammerstein's Approach
2007
This paper deals with the modelling of highly nonlinear switching power-electronics converters using black-box identification methods. The duty cycle and the output voltage are chosen, respectively, as the input and the output of the model. A nonlinear Hammerstein-type mathematical model, consisting of a static nonlinearity and a linear time-invariant model, is considered in order to cope with the well-known limitations of the more common small-signal models, i.e. the entity of the variations of the variables around a well-defined steady-state operating point and the incorrect reproduction of the steady-state behavior corresponding to input step variations from the above steady-state operat…
All-optical measurements of background, amplitude, and timing jitters for high speed pulse trains or PRBS sequences using autocorrelation function
2008
International audience; We present a simple method for all-optical measurements of background, amplitude, and timing jitters of ultra high speed pulse trains or PRBS sequences using the jitter dependence of the intercorrelation-peak shape. This method is numerically and experimentally demonstrated on a 42.66 Gbit/s PRBS sequence and then applied to measure the jitter growths occurring during the propagation of a 160-GHz pulse train in a classical SMF/DCF dispersion map.
All-Optical Measurement of Background, Amplitude and Timing Jitter for high speed pulse trains or prbs sequences using autocorrelation function
2006
We present a simple method for all-optical measurements of background, amplitude- and timing-jitter of ultra high speed pulse trains or prbs sequences using the jitter dependences of the intercorrelation-peak shape.